An Introduction to the AKS Primality Test
نویسندگان
چکیده
Input: An integer n > 1. 0: if n is a power then output composite fi; 1: r := 2; 2: while (r < n) do 3: if gcd(r, n) 6= 1 then output composite fi; 4: if r is prime then 5: q := largest prime factor of r − 1; 6: if (q ≥ 4√r log n) and (n(r−1)/q 6≡ 1 mod r) then break fi; 7: fi; 8: r := r + 1; 9: od; 10: for a = 1 to 2 √ r log n do 11: if (x− a)n 6≡ (xn − a) mod (xr − 1, n) then output composite fi; 12: od; 13: output prime;
منابع مشابه
An Empirical Study towards Refining the AKS Primality Testing Algorithm
The AKS (Agrawal-Kayal-Saxena) algorithm is the first ever deterministic polynomialtime primality-proving algorithm whose asymptotic run time complexity is O(log n), where > 0. Despite this theoretical breakthrough, the algorithm serves no practical use in conventional cryptologic applications, as the existing probabilistic primality tests like ECPP in conjunction with conditional usage of sub-...
متن کاملSome remarks and questions about the AKS algorithm and related conjecture
We show that AKS-algorithm for primality testing ( see [1]) can be modified to run in Õ(log n) time. We present some remarks and ask two questions related to this algorithm.
متن کاملGenerating Primes Using Partitions
This paper presents a new technique of generating large prime numbers using a smaller one by employing Goldbach partitions. Experiments are presented showing how this method produces candidate prime numbers that are subsequently tested using either Miller Rabin or AKS primality tests. Introduction Generation of large prime numbers is fundamental to modern cryptography protocols [1],[2], generat...
متن کاملA Note On the Storage Requirement for AKS Primality Testing Algorithm
We remark that AKS primality testing algorithm needs about 1,000,000,000 G (gigabyte) storage space for a number of 1024 bits. Such storage requirement is hard to meet in practice. To the best of our knowledge, it is impossible for current operating systems to write and read data in so huge storage space. Thus, the running time for AKS algorithm should not be simply estimated as usual in terms ...
متن کاملPrimality Proving via One round in Ecpp and One Iteration
On August 2002, Agrawal, Kayal and Saxena announced the first deterministic and polynomial time primality testing algorithm. For an input n, the AKS algorithm runs in heuristic time Õ(log n). Verification takes roughly the same amount of time. On the other hand, the Elliptic Curve Primality Proving algorithm (ECPP) runs in random heuristic time Õ(log n) ( Õ(log n) if the fast multiplication is ...
متن کامل